Well-founded and stable semantics of logic programs with aggregates
نویسندگان
چکیده
منابع مشابه
Well-founded and stable semantics of logic programs with aggregates
In this paper, we present a framework for the semantics and the computation of aggregates in the context of logic programming. In our study, an aggregate can be an arbitrary interpreted second order predicate (or function). We define extensions of the KripkeKleene, the well-founded and the stable semantics for aggregate programs. The semantics is based on the concept of a three-valued immediate...
متن کاملUltimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
In [3] we investigate the problem of defining a well-founded and stable semantics for programs with aggregates. Our work is based on Approximation Theory [1] which is a general algebraic framework for approximating non-monotone operators on a complete lattice L by approximating operators on the bi-lattice L. The theory identifies basic properties of the approximating operators and gives a metho...
متن کاملWell Founded Semantics and Stable Semantics of Semi-Strict Programs
In this paper we exhibit a condition on the syntax of the logic programs with negation, the semi-strictness property, which assures the equivalence of the well founded semantics and the stable semantics: so, for semi-strict programs the well founded model is total if and only if the program has an unique stable model.
متن کاملWell-Founded Semantics for Logic Programs with Aggregates: Implementation and Experimentation
Aggregate constructs are one of the major linguistic extensions to logic programming. In this paper, we focus on logic programming with monotone and antimonotone aggregate literals with the well-founded semantics defined in [1], which allows for aggregates occurring in recursive definitions. We formally show that computing this semantics is tractable and present a prototype system obtained by m...
متن کاملThe Approximate Well-Founded Semantics for Logic Programs with Uncertainty
The management of uncertain information in logic programs becomes to be important whenever the real world information to be represented is of imperfect nature and the classical crisp true, false approximation is not adequate. A general framework, called Parametric Deductive Databases with Uncertainty (PDDU) framework [10], was proposed as a unifying umbrella for many existing approaches towards...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2007
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068406002973